3 // Copyright (C) 2005, 2006, 2009 Free Software Foundation, Inc.
5 // This file is part of the GNU ISO C++ Library. This library is free
6 // software; you can redistribute it and/or modify it under the terms
7 // of the GNU General Public License as published by the Free Software
8 // Foundation; either version 3, or (at your option) any later
11 // This library is distributed in the hope that it will be useful, but
12 // WITHOUT ANY WARRANTY; without even the implied warranty of
13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 // General Public License for more details.
16 // Under Section 7 of GPL version 3, you are granted additional
17 // permissions described in the GCC Runtime Library Exception, version
18 // 3.1, as published by the Free Software Foundation.
20 // You should have received a copy of the GNU General Public License and
21 // a copy of the GCC Runtime Library Exception along with this program;
22 // see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
23 // <http://www.gnu.org/licenses/>.
25 // Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
27 // Permission to use, copy, modify, sell, and distribute this software
28 // is hereby granted without fee, provided that the above copyright
29 // notice appears in all copies, and that both that copyright notice
30 // and this permission notice appear in supporting documentation. None
31 // of the above authors, nor IBM Haifa Research Laboratories, make any
32 // representation about the suitability of this software for any
33 // purpose. It is provided "as is" without express or implied
37 * @file order_statistics_imp.hpp
38 * Contains forward declarations for order_statistics_key
42 inline typename PB_DS_CLASS_C_DEC::iterator
44 find_by_order(size_type order)
51 node_iterator nd_it = node_begin();
53 node_iterator end_nd_it = node_end();
57 if (order > nd_it.get_metadata())
58 return (++base_type::rightmost_it(nd_it));
60 const size_type num_children = nd_it.num_children();
62 if (num_children == 0)
65 for (size_type i = 0; i < num_children; ++i)
67 node_iterator child_nd_it = nd_it.get_child(i);
69 if (order <= child_nd_it.get_metadata())
76 order -= child_nd_it.get_metadata();
82 inline typename PB_DS_CLASS_C_DEC::const_iterator
84 find_by_order(size_type order) const
86 return (const_cast<PB_DS_CLASS_C_DEC* >(this)->find_by_order(order));
90 inline typename PB_DS_CLASS_C_DEC::size_type
92 order_of_key(const_key_reference r_key) const
94 const E_Access_Traits& r_traits =
95 const_cast<PB_DS_CLASS_C_DEC* >(this)->get_e_access_traits();
97 return (order_of_prefix(
98 r_traits.begin(r_key),
99 r_traits.end(r_key)));
103 inline typename PB_DS_CLASS_C_DEC::size_type
105 order_of_prefix(typename e_access_traits::const_iterator b, typename e_access_traits::const_iterator e) const
110 const E_Access_Traits& r_traits =
111 const_cast<PB_DS_CLASS_C_DEC* >(this)->get_e_access_traits();
113 const_node_iterator nd_it = node_begin();
115 const_node_iterator end_nd_it = node_end();
121 const size_type num_children = nd_it.num_children();
123 if (num_children == 0)
125 const_key_reference r_key =
126 base_type::extract_key(*(*nd_it));
128 typename e_access_traits::const_iterator key_b =
129 r_traits.begin(r_key);
131 typename e_access_traits::const_iterator key_e =
134 return ((base_type::less( key_b, key_e, b, e, r_traits))?
139 const_node_iterator next_nd_it = end_nd_it;
141 size_type i = num_children - 1;
145 const_node_iterator child_nd_it = nd_it.get_child(i);
147 if (next_nd_it != end_nd_it)
148 ord += child_nd_it.get_metadata();
149 else if (!base_type::less(
151 child_nd_it.valid_prefix().first,
152 child_nd_it.valid_prefix().second,
154 next_nd_it = child_nd_it;
158 if (next_nd_it == end_nd_it)
168 operator()(node_iterator nd_it, const_node_iterator /*end_nd_it*/) const
170 const size_type num_children = nd_it.num_children();
172 size_type children_rank = 0;
174 for (size_type i = 0; i < num_children; ++i)
175 children_rank += nd_it.get_child(i).get_metadata();
177 const_cast<size_type& >(nd_it.get_metadata()) =(num_children == 0)? 1 : children_rank;
182 ~trie_order_statistics_node_update()